Salem–Zygmund inequality for locally sub-Gaussian random variables, random trigonometric polynomials, and random circulant matrices

نویسندگان

چکیده

Abstract In this manuscript we give an extension of the classic Salem–Zygmund inequality for locally sub-Gaussian random variables. As application, concentration roots a Kac polynomial is studied, which main contribution manuscript. More precisely, assume existence moment generating function iid coefficients and prove that there exists annulus width $$\begin{aligned} \text {O}( n^{-2}(\log n)^{-1/2-\gamma }), \quad \gamma >1/2\end{aligned}$$ O ( n - 2 log ) 1 / γ , > around unit circle does not contain with high probability. another show smallest singular value circulant matrix at least $$n^{-\rho }$$ ρ , $$\rho \in (0,1/4)$$ ∈ 0 4 probability $$1-\text n^{-2\rho })$$ .

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chapter 1: Sub-Gaussian Random Variables

where μ = IE(X) ∈ IR and σ = var(X) > 0 are the mean and variance of X . We write X ∼ N (μ, σ). Note that X = σZ + μ for Z ∼ N (0, 1) (called standard Gaussian) and where the equality holds in distribution. Clearly, this distribution has unbounded support but it is well known that it has almost bounded support in the following sense: IP(|X −μ| ≤ 3σ) ≃ 0.997. This is due to the fast decay of the...

متن کامل

Matrix Decompositions Using sub-Gaussian Random Matrices

In recent years, several algorithms which approximate matrix decomposition have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We present a new algorithm, which achieves with high probability a rank-r SVD approximation of an n × n matrix and derive an error bound that does not depend on the first r singular values. Althou...

متن کامل

Random matrices, random polynomials and Coulomb systems

It is well known that the joint probability density of the eigenvalues of Gaussian ensembles of random matrices may be interpreted as a Coulomb gas. We review these classical results for hermitian and complex random matrices, with special attention devoted to electrostatic analogies. We also discuss the joint probability density of the zeros of polynomials whose coefficients are complex Gaussia...

متن کامل

Random Polynomials, Random Matrices and L-functions

We show that the Circular Orthogonal Ensemble of random matrices arises naturally from a family of random polynomials. This sheds light on the appearance of random matrix statistics in the zeros of the Riemann zeta-function.

متن کامل

Fano's inequality for random variables

We extend Fano’s inequality, which controls the average probability of (disjoint) events in terms of the average of some Kullback-Leibler divergences, to work with arbitrary [0, 1]–valued random variables. Our simple two-step methodology is general enough to cover the case of an arbitrary (possibly continuously infinite) family of distributions as well as [0, 1]–valued random variables not nece...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Boletin De La Sociedad Matematica Mexicana

سال: 2022

ISSN: ['2296-4495', '1405-213X']

DOI: https://doi.org/10.1007/s40590-022-00437-4